建立和完善武器装备采办监督约束机制

分析了当前我军装备采办过程中采办监督机制存在的主要问题 ,讨论了建立有效装备采办约束机制所应遵循的一些基本原则 ,并就建立有效的装备采办监督约束机制所应开展的工作提出了比较全面的观点。     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

基于神经网络的舰船建造费用预测分析

采用了一种基于神经网络的舰船建造费预测方法 .计算结果表明 ,这种方法与传统的参数法相比较 ,有更好的估算精度 ,因而该方法可以作为研究此类问题的新途径     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

军事概念模型知识获取过程方法和工具

军事概念模型是独立于实现的真实世界的实体、任务等作战要素的表示.军事概念模型是军事建模仿真系统开发中非常重要的一步,对于仿真的可信度具有重要的影响.从知识系统开发的观点将军事概念模型开发分成知识获取和知识工程两个阶段.探讨了军事知识获取的过程,知识结构化描述的表示方法、语言和描述过程,在此基础上开发了支持军事概念模型知识获取的工具"兵书一号",并得到了广泛的推广和应用.     

树状军事通信网中的文件传输优化算法

针对树状军事通信网中的文件传输优化问题,提出了一种有效的寻找最优的树图边着色算法,该算法保证了边着色后的树图中"延迟损耗"总和最小,并由求取最小"延迟损耗"的反向推导过程得到最优的树状通信网文件传输方案.算法的计算复杂度是,其中为顶点数,为树的最大度.     

Think again – supplying war: reappraising military logistics and its centrality to strategy and war

This article argues that logistics constrains strategic opportunity while itself being heavily circumscribed by strategic and operational planning. With the academic literature all but ignoring the centrality of logistics to strategy and war, this article argues for a reappraisal of the critical role of military logistics, and posits that the study and conduct of war and strategy are incomplete at best or false at worst when they ignore this crucial component of the art of war. The article conceptualises the logistics–strategy nexus in a novel way, explores its contemporary manifestation in an age of uncertainty, and applies it to a detailed case study of UK operations in Iraq and Afghanistan since 2001.     

基于状态的检查与修理综合决策模型

分析了单部件系统退化过程的特点，建立了基于状态的检查与修理决策模型。该模型根据系统的当前状态来决定检查与修理，通过分析计算系统在一个更新周期内平均检查次数、预防性维修及修复性故障的概率，建立维修费用与检查问隔及预防性维修阈值的关系，以平均维修费用最小为目标，优化检查间隔及预防性维修阈值。最后运用Matlab对模型进行数值计算，结果表明，模型能有效地降低维修费用。     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051